Recurrence relations with periodic coefficients and Chebyshev polynomials
نویسندگان
چکیده
منابع مشابه
Chebyshev Polynomials with Integer Coefficients
We study the asymptotic structure of polynomials with integer coef cients and smallest uniform norms on an interval of the real line Introducing methods of the weighted potential theory into this problem we improve the bounds for the multiplicities of some factors of the integer Chebyshev polynomials Introduction Let Pn C and Pn Z be the sets of algebraic polynomials of degree at most n respect...
متن کاملNonstandard Braid Relations and Chebyshev Polynomials
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two Sr-irreducibles into irreducibles. Mulmuley and Sohoni attempt to solve this problem using canonical basis theory, by first constructing a nonstandard Hecke algebra Br, which, though not a Hopf al...
متن کاملQuantized Chebyshev polynomials and cluster characters with coefficients
We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials arise in cluster algebras with principal coefficients associated to acyclic quivers of infinite representation types and equioriented Dynkin quivers of type A. ...
متن کاملRecurrence Relations for Chebyshev - Type Methods ∗
The convergence of new second-order iterative methods are analyzed in Banach spaces by introducing a system of recurrence relations. A system of a priori error bounds for that method is also provided. The methods are defined by using a constant bilinear operator A, instead of the second Fréchet derivative appearing in the defining formula of the Chebyshev method. Numerical evidence that the met...
متن کاملMotzkin Paths, Motzkin Polynomials and Recurrence Relations
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1995
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-23-3-319-323